<body>
From Mastering Algorithms with C
Heaps : Trees organized so that we can determine the node with the largest value quickly. The cost to preserve this property is less than that of keeping the data sorted. We can also organize a heap so that we can determine the smallest value just as easily.
Heaps are filled from left to right.
</body>